Error Correcting Codes and Combinatorial Games
نویسنده
چکیده
The \losing positions" of certain combinatorial games constitute linear error detecting and correcting codes. We show that annihilation games provide a potentially polynomial method for computing codes (anncodes). We also give a short proof of the basic properties of the previously known lexicodes, which are deened by means of an exponential algorithm, and are related to game theory. In the nal section we indicate, by means of an example, how the method of producing lexicodes can be applied optimally to nd anncodes.
منابع مشابه
Error-Correcting Codes Derived from Combinatorial Games
The losing positions of certain combinatorial games constitute linear error-detecting and -correcting codes. We show that a large class of games, which can be cast in the form of annihilation games, provides a potentially polynomial method for computing codes (anncodes). We also give a short proof of the basic properties of the previously known lexicodes, which were defined by means of an expon...
متن کاملTwo-player games on cellular automata
Cellular automata games have traditionally been 0-player or solitaire games. We define a two-player cellular automata game played on a finite cyclic digraph G = (V, E). Each vertex assumes a weight w ∈ {0, 1}. A move consists of selecting a vertex u with w(u) = 1 and firing it, i.e., complementing its weight and that of a selected neighborhood of u. The player first making all weights 0 wins, a...
متن کاملApplying, Improving and Analyzing Some Heuristics for Binary Codes in Combinatorial DNA Design
Combinatorial algorithms have long been used to design error correcting codes with various constraints such as Hamming distance or weight. Such algorithms have been used to design DNA codes, which parallel error correcting codes in many ways. We implemented two algorithms from coding theory and adapted them for DNA. We tried several improvements and combinations and we will discuss the empirica...
متن کاملImproved Combinatorial Bounds on Variable Length Error Correcting Codes
Theory of error correcting codes mostly considers all words of same lengths. Mathematical tools of linear algebra and finite fields greatly helped in its development. However all words of equal lengths idea compromises with efficiency which can be better achieved through variable length codes for noisy channels. There is quite some interest and scope in error coding through variable length cod ...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007